ON WEIGHING-MACHINES. (INCLUDES PLATES AND APPENDICES).
نویسندگان
چکیده
منابع مشابه
On circulant weighing matrices
Algebraic techniques are employed to obtain necessary conditions for the existence of certain circulant weighing matrices. As an application we rule out the existence of many circulant weighing matrices. We study orders n = 8 +8+1, for 10 ~ 8 ~ 25. These orders correspond to the number of points in a projective plane of order 8.
متن کاملAutomatic classification of steel plates based on Laser Induced Breakdown Spectroscopy and Support Vector Machines
Welding processes are one of the most widely spread industrial activities, and their quality control is an important area of research. The presence of residual traces from the protective antioxidant coating, is a problematic issue since it causes a significant reduction in the welding seam strength. In this work, a solution based on a Laser Induced Breakdown Spectroscopy (LIBS) setup and a Supp...
متن کاملon semihypergroups and hypergroups
in this thesis, first the notion of weak mutual associativity (w.m.a.) and the necessary and sufficient condition for a $(l,gamma)$-associated hypersemigroup $(h, ast)$ derived from some family of $lesssim$-preordered semigroups to be a hypergroup, are given. second, by proving the fact that the concrete categories, semihypergroups and hypergroups have not free objects we will introduce t...
15 صفحه اولOn circulant and two-circulant weighing matrices
We employ theoretical and computational techniques to construct new weighing matrices constructed from two circulants. In particular, we construct W (148, 144), W (152, 144), W (156, 144) which are listed as open in the second edition of the Handbook of Combinatorial Designs. We also fill a missing entry in Strassler’s table with answer ”YES”, by constructing a circulant weighing matrix of orde...
متن کاملSequential Bayesian Search Appendices
Assume that at the beginning of game t, the system's belief in the user's preference is P t. Then, the certainty-equivalet user preference during game t is π * t (i) = E π∼Pt [π(i)] ∀i ∈ I. Recall we define π * min = min i∈I π * (i), Lemma A-1 formalizes the result that if π * t is " close " to π * , then for any decision tree T , E i∼π * t [N (T, i)] is " close " to E i∼π * [N (T, i)]: Lemma A...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Minutes of the Proceedings of the Institution of Civil Engineers
سال: 1892
ISSN: 1753-7843
DOI: 10.1680/imotp.1892.20187